# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase, Stack


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def licenseKeyFormatting(self, s: str, k: int) -> str:
        ans = ""
        stack = Stack()
        s_len = len(s)
        
        is_tail = True
        
        for i in range(s_len - 1, -1, -1):
            if s[i] != '-':
                stack.push(s[i].upper())
                if stack.size() == k:
                    part = stack.get_data_list()
                    part.reverse()
                    
                    if is_tail:
                        ans = "".join(part)
                        is_tail = False
                    else:
                        ans = "".join(part) + "-" + ans 
                    
                    stack.remove_all()
        
        if stack.size() != 0:
            part = stack.get_data_list()
            part.reverse()
            if len(ans) > 0:
                ans = "".join(part) + "-" + ans
            else:
                ans = "".join(part)
        
        return ans
    

if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ("5F3Z-2e-9-w", 4, "5F3Z-2E9W"),
        ("2-5g-3-J", 2, "2-5G-3J")
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]
        exec_result = solution.licenseKeyFormatting(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

